Parallel Computation of Component Trees on Distributed Memory Machines
نویسندگان
چکیده
منابع مشابه
Vector Prefix and Reduction Computation on Coarse-Grained, Distributed-Memory Parallel Machines
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines. Our algorithms are relatively architecture independent and can be used effectively in many applications su...
متن کاملParallel Implementations of Perceptual Grouping Tasks on Distributed Memory Machines
(Summary of Results) Abstract In this paper, we propose parallel implementations for solving Perceptual Grouping tasks on distributed memory machines. Our implementations show that, given 7K line segments extracted from a 1K 1K image, the Line Grouping task can be performed in 0.486 seconds using a partition of CM-5 having 256 processing nodes and in 0.382 seconds using a 16-node Cray T3D. The ...
متن کاملLogically Instantaneous Communication on Top of Distributed Memory Parallel Machines
Communication is Logically Instantaneous (li) if it is possible to timestamp communication events with integers in such a way that (1) timestamps increase within each process and (2) the sending and the delivery events associated with each message have the same timestamp. So, there is a logical time frame in which for each message, the send event and the corresponding delivery events occur simu...
متن کاملComputation of Dendrites on Parallel Distributed Memory Architectures
A code for simulating the solidi cation of a pure material from its undercooled melt based on a phase eld approach has been written for parallel distributed memory architectures using MPI. The numerical scheme is based on nite di erences and results in large sparse non-linear systems which are solved by a backtracking line search modi cation of Newton's method combined with GMRES. Experiments c...
متن کاملA Parallel Algorithm for Connected Components on Distributed Memory Machines
Finding connected components (CC) of an undirected graph is a fundamental computational problem. Various CC algorithms exist for PRAM models. An implementation of a PRAM CC algorithm on a coarse-grain MIMD machine with distributed memory brings many problems, since the communication overhead is substantial compared to the local computation. Several implementations of CC algorithms on distribute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2018
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2018.2829724